Galileon string measure and other modified measure extended objects

A linearly computable measure of string complexity

We present a measure of string complexity, called I-complexity, computable in linear time and space. It counts the number of different substrings in a given string. The least complex strings are the runs of a single symbol, the most complex are the de Bruijn strings. Although the I-complexity of a string is not the length of any minimal description of the string, it satisfies many basic propert...

Measure Phrase Equatives and Modified Numerals

In English, equatives can be formed with a numeral or measure phrase (MP) standard (e.g. John can dive as deep as 500m; Rett, 2010). These ‘measure phrase equatives’ (MPEs) differ semantically from their clausal counterparts (e.g. John can dive as deep as Sue can) in two important ways. First, while clausal standards set lower bounds, resulting in an ‘at least’ interpretation of the equative, M...

Ranking of generalized fuzzy numbers using distance measure and similarity measure

Extended Precision Quality Measure for Recommender Systems

Recommender systems are highly sensitive to cases of falsepositives, that is, recommendations made which have proved not to be relevant. These situations often lead to a loss of trust in the system by the users; therefore, every improvement in the recommendation quality measures is important. Recommender systems which admit an extensive set of values in the votes (usually those which admit more...

A Similarity Measure of Spatial Databases ( Extended